Data-driven layout engine

ABSTRACT

Systems and methods for providing a user with increased flexibility and control over the appearance and behavior of objects on a user interface are described. Sets of objects can be grouped into themes to provide a user with a distinct overall impression of the interface. These themes can be switched dynamically by switching pointers to drawing procedures or switching data being supplied to these procedures. To buffer applications from the switchable nature of graphical user interfaces according to the present invention, colors and patterns used to implement the interface objects are abstracted from the interface by, for example, pattern look-up tables.

RELATED APPLICATIONS

This application is a continuation-in-part of U.S. patent application Ser. No. 08/242,963 entitled “Pattern and Color Abstraction in a Graphical User Interface”, U.S. patent application Ser. No. 08/243,368 entitled “Switching Between Appearance/Behavior Themes in Graphical User Interfaces” now U.S. Pat. No. 5,554,746 and U.S. patent application Ser. No. 08/243,327 entitled “A System and Method for Customizing Appearance and Behavior of Graphical User Interfaces”, all of which were filed on May 16, 1994 and all of which are hereby incorporated by reference.

COPYRIGHT NOTICE

A portion of the disclosure of this patent document contains material which is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction of the patent disclosure as it appears in the Patent and Trademark Office patent file or records, but otherwise reserves all copyright rights whatsoever.

BACKGROUND

The present invention relates generally to graphical user interfaces for computer systems. More particularly, the present invention relates to systems and methods for interfacing applications and operating systems which provide for flexible customization of graphical user interfaces.

The evolution of the computer industry is unparalleled in its rate of growth and complexity. Personal computers, for example, which began as little more than feeble calculators with limited memory, tape-driven input and monochrome displays are now able to tackle almost any data processing task. While this meteoric increase in power was almost sufficient to satisfy the demand of application programmers and end users alike, the corresponding increase in complexity created an ease-of-use problem which the industry was somewhat slower in solving. Thus, designers were faced with a new challenge: to harness this computing power in a form usable by even those with relatively little computer training to smooth the transition of other industries into a computer-based information paradigm.

As a result, in the early to mid-1980's many new I/O philosophies, such as “user friendly”, “WYSIWYG” and “menu driven” came to the forefront of the industry. These concepts are particularly applicable to microcomputers, also known as personal computers, which are intended to appeal to a broad audience of computer users, including those who previously feared and mistrusted computers. An important aspect of computers which employ these concepts was, and continues to be, the interface which allows the user to input commands and data and receive results, which is commonly referred to as a graphical user interface (GUI).

One type of GUI display is based on a visual metaphor which uses a monitor screen as a work surface called a “desktop” where documents are presented in relocatable regions termed “windows”. The user interacts with the computer by, for example, moving objects on the desktop, choosing commands from menus, and manipulating window controls, such as checkboxes and scroll bars. An exemplary desktop screen is reproduced as FIG. 1.

The success of this type of interface is evident from the number of companies which have emulated the desktop environment. Even successful concepts, however, must continually be improved in order to keep pace with the rapid growth in this industry. The advent of multimedia, especially CD-ROM devices, has provided vast quantities of secondary storage which have been used to provide video capabilities, e.g., live animation and video clips, as regular components of application displays. With these new resources at their disposal, application designers, and others, desire more and more control over the appearance of the display, including the desktop environment and, in particular, objects on the desktop.

Windows are one example of desktop objects which can be virtually any size, shape, or color. Some standard types of windows are commonly predefined for the interface including, for example, a document window and a dialog box. One example of a standard for a document window is illustrated in FIG. 2A. Each document window which conforms to this standard has a title bar with a title drawn in a system-defined font and color. Active document windows can also have controls as illustrated in FIG. 2A, for example, a close box, a zoom box, a size box, and scroll bars. These standard types of windows (as well as other standard desktop objects) are beyond the reach of users who wish to alter the appearance and/or behavior.

Accordingly, application developers can define their own nonstandard window types as desired, although each nonstandard window requires a relatively large block of memory. Further, even these nonstandard window types provide only limited flexibility and control over the appearance and behavior of desktop objects in that they are application-specific and do not present a consistent interface across all applications, i.e., if three different applications are running, each might present a different “look” on desktop. Once again, the user has virtually no control over the appearance and/or behavior of these nonstandard window objects.

Since the window format, including the appearance, behavior and function of standard windows and window parts, is known a priori to applications which were designed for such conventional systems, these applications are written to take advantage of such knowledge. As seen in FIG. 3, suppose, for example, that an application 10 desires to draw a rectangle in the color of the title bar (beige, in this example) in a window (not shown on the desktop). The application assumes knowledge of the color of the title bar when using predefined standard window definitions 25 and, if this application uses window definitions created by the application itself, the application will have actual knowledge of colors defined by those windows. Accordingly, the application will simply send a command to the interface instructing that a beige rectangle be drawn in the window.

Each standard window, as well as any nonstandard window, conventionally has a corresponding window definition 25. The window definition 25 includes all of the data necessary to define the window. Looking at the active window illustrated in FIG. 1, data included in the window definition 25 for such an active window would include, for example, the size of the window, the relative location of the close box and zoom box in the upper lefthand and righthand corners, respectively, the number of parallel lines and their locations relative to the close box and the zoom box, and the upper boundary of the window and all of the other defining features of that particular window. The application supplies the variable parameters such as the location of the window on the desktop interface and, perhaps, the colors and/or fonts to be used for the text and/or figures in the window. As one can imagine, the window definitions can include a large amount of data and, therefore, can require a large amount of memory for each definition.

In addition to the amount of memory used to create non-standard window definitions, another problem with this conventional method of providing variety of appearance in the graphical user interface is the lack of a consistent appearance between objects drawn on the desktop by different applications. With multitasking i.e., multiple applications running simultaneously on a desktop, it is now common for users to simultaneously run multiple applications each of which has its own window on the desktop. However, if each application uses its own combination of standard and non-standard window definitions that result in each application having its own appearance and behavior. The dissimilarity in appearance and behavior between applications can be annoying and confusing to a user.

Accordingly, it would be desirable to allow application designers and application users to have additional flexibility and greater control over the appearance and behavior of desktop objects and individual controls for those objects.

SUMMARY

According to exemplary embodiments of the present invention, an improved visual appearance can be provided to GUIs by providing a layout engine which provides a data-driven facility to customize the appearance and behavior of the desktop. This layout engine can, for example, be designed to receive commands from definition objects and provide instructions to the graphic subsystem which actually writes to the display. In this way, a level of abstraction is provided between the client and the system so that customization can be facilitated without requiring the client to have a detailed knowledge of the interface environment, which may be constantly changing.

According to exemplary embodiments of the present invention, data structures for the layout resources are designed to allow the layout engine to operate efficiently. For example, a layout resource is specified so that the parts are redrawn correctly when the parent rectangle changes size. This type of functionality is provided by layout boundaries. The layout boundaries for each part identified in the layout resource can be placed on the display relative to a parent shape, e.g., a rectangle. When the layout engine is called to either draw or create a region, it first places the boundaries stored in the data structures associated with the layout resource. The location of the boundary can be calculated and stored so that when a part is drawn relative to the boundary, the part can be drawn on the screen in the right place.

Once the boundaries are placed, then the parts list is traversed by the layout engine. The layout engine checks to see if the part is a member of the set which is currently being drawn. If that part is not a member of the set, which can occur since layout resources can be used to draw different types of window objects, for example, then the listed part is not drawn. If the part is a member of the set being drawn, the attributes provided within the layout resource data structure for that part are checked to see if the part is valid. If the part is a member of the correct set and it is valid, then the part is drawn at the position specified by its previously placed boundaries.

A significant advantage of the data structures described above is that they are organized as a list of boundary parameters and part parameters which need only be traversed once by the layout engine to create the associated object. This provides benefits in terms of execution speed when rendering objects on the user interface.

BRIEF DESCRIPTION OF THE DRAWINGS

The foregoing, and other, objects, features and advantages of the present invention will be more readily understood by those skilled in the art upon reading the following detailed description in conjunction with the drawings in which:

FIG. 1 shows a conventional desktop screen;

FIG. 2A shows a conventional document window;

FIG. 2B illustrates a document window according to an exemplary embodiment of the present invention;

FIG. 2C illustrates a conventional user interface;

FIG. 2D illustrates the user interface of FIG. 2C operating under a theme according to an exemplary embodiment of the present invention;

FIG. 2E illustrates the user interface of FIG. 2C operating under a second theme according to another exemplary embodiment of the present invention;

FIG. 3 illustrates a functional overview of a system for customizing a user interface according to an exemplary embodiment of the present invention;

FIG. 4 illustrates an exemplary architecture showing theme and application interaction according to an exemplary embodiment of the present invention;

FIG. 5A illustrates a block diagram representation of various layers used to provide a user interface according to an exemplary embodiment of the present invention;

FIG. 5B illustrates the use of boundaries according to an exemplary embodiment of the present invention;

FIG. 5C is another illustration which describes the use of boundaries according to exemplary embodiments of the present invention;

FIG. 5D depicts variations in rendering a title bar for different window size conditions;

FIG. 5E is a flowchart used to describe operation of an exemplary layout engine according to an exemplary embodiment of the present invention;

FIG. 6 is a state diagram used to illustrate transitions of an interface object part according to an exemplary embodiment of the present invention;

FIG. 7 is an exemplary matrix used to describe behavior transitions according to exemplary embodiments in the present invention;

FIG. 8 is a block diagram illustrating inheritance according to an exemplary embodiment of the present invention;

FIG. 9 is a block diagram which illustrates pattern abstraction according to an exemplary embodiment of the present invention;

FIG. 10 is a block diagram which also illustrates pattern abstraction, but according to another exemplary embodiment of the present invention;

FIG. 11 illustrates an exemplary appearance control panel according to an exemplary embodiment of the present invention;

FIG. 12 illustrates an interaction between an appearance management layer, an application, and a theme according to an exemplary embodiment of the present invention; and

FIGS. 13-15 are flowcharts which illustrate exemplary methods used to switch themes according to exemplary embodiments of the present invention.

DETAILED DESCRIPTION

The present invention is described herein by way of exemplary, illustrative embodiments, some of which use the Macintosh® computer system as a reference for explaining the present invention. However, those skilled in the art will readily appreciate that systems and methods according to the present invention can be applied to any type of display system having a user interface. Further, while window objects are used to illustrate how exemplary embodiments of the present invention affect the appearance and behavior of desktop objects in general, those skilled in the art will recognize that the present invention can be used to control the appearance and behavior of any desktop object including, for example, icons, menus, lists, control elements, cursors, menu bars, etc.

Windows can be characterized in a variety of ways. For example, a window can be characterized by the shape, size and color of the window as well as by the location, size, shape and color of its component parts, e.g., those parts identified in FIG. 2A. These attributes of a window and window parts are categorized herein as a window's appearance attributes. The window and its parts also have associated therewith one or more functions which are invoked when a user provides an associated input, e.g., clicking on a close button or box causes the window to close. These are termed functional attributes.

A third category of attributes also exists for some windows and window parts. These windows and window parts exhibit a behavior when acted on by a user which is distinct from the underlying function of these objects, i.e., when a user clicks on a close button using a mouse, the button becomes shaded in such a way that it appears depressed prior to the window actually closing. These are termed behavior attributes.

Of these three attribute categories, namely appearance, behavior and function, exemplary embodiments of the present invention provide users (the term “users” as applied throughout this document refers to, among others, end users of applications, application developers and other individuals who use or invoke operating systems) with the capability to alter the appearance and behavior of object and object parts, but preferably not the underlying function thereof. It will be understood by those skilled in the art that the principles described herein are equally applicable to systems and methods in which the functional attributes can also be varied by users. However, standardization of system functionality provides certain advantages so that exemplary embodiments of the present invention separate functional manipulation from manipulation of the other attributes.

Given all of the graphical and audio artistry available today for GUIs, one can easily imagine the wide variety of desktop “looks” which can be developed once the system's control over the appearance and behavior of interface objects is relaxed. Comparison of the conventional user interface screen shown in FIG. 2C with user interface screens using different themes shown in FIGS. 2D and 2E is an excellent starting point toward understanding the powerful capabilities for appearance and behavior change in user interfaces according to the present invention. Note, for example, the difference in appearance between the “Views” title bar in FIG. 2C as opposed to those of FIGS. 2D and 2E.

An overview which summarizes how these types of customized user interfaces can be provided in a consistent and switchable manner begins with a discussion of FIG. 4. As shown, the application 38 interacts with the appearance management layer 40 through three paths: directly, through utilities 42 (e.g., Toolbox Managers), and through drawing procedures 46 which provide the fundamental instructions (e.g., defprocs) for drawing objects on the interface. The phrase “drawing procedure” as it is used in this document refers to pieces of code which are responsible for drawing interface objects and which define the shape of those objects, e.g., window definitions.

Note that the application does not access the drawing procedures directly, but does so through a table of pointers 44 maintained by the appearance management layer and utilities. Switchable pointers 44 and drawing procedures 46 provide the basic building blocks which allow the geometry of each interface object as well as the behavior of each object's controls to be manipulated in a consistent and replaceable fashion. By switching the pointers 44 to the drawing procedures 46, or by switching the data used by the procedures 46, the appearance and behavior of the interface can be readily changed.

To provide the flexibility afforded by the present invention, applications do not need to have a priori knowledge of the patterns or colors used for each object and its controls. Therefore, a pattern table 48 is used to look up this information and serves to abstract the color and/or pattern of the object from its other attributes. According to certain exemplary embodiments, drawing primitives which allow “paint-by-number” interface drawing are sent by the client to the appearance management layer. In other words, the application can simply command the appearance management layer 40 to draw an object using an index which identifies the pattern and/or color of that object, so that the visual geometry is abstracted from the colorspace and the application need not know which particular geometries and/or colors are currently being implemented. According to other exemplary embodiments, the pattern table 48 acts as a pattern/color database and returns the relevant pattern information to the client. The client then instructs the graphic subsystem 56 to render the appropriate pattern.

In order to provide the functionality to switch between themes, the theme switching 50 and run time support 52 control interaction of the appearance management layer and the theme. As used herein, the terms “theme” and “themes” refer to coordinated designs of interface objects and object parts that create a distinct visual appearance on the display. These routines provide mechanisms for loading and unloading themes and obtaining theme attributes. Various routines are also provided to support animation and sounds and handling desktop patterns and screen saver modules in the interface as shown generally by block 54.

Switchable Pointers and Drawing Procedures

Many of the objects which are drawn in the user interface are created by small, modular pieces of code in the system which are dedicated to a specific purpose, e.g., drawing window frames. These pieces of code, called drawing procedures or definition procedures (defprocs) herein, are designed for switching at run time to enable dynamic system appearance and behavior. While the procedure and mechanism for switching between themes is described in more detail below, this section focuses on exemplary ways in which these procedures are designed to provide a switchable routine environment.

The appearance management layer 40 is responsible for orchestrating various changes which allow switching of the user interface's appearance and behavior. Two exemplary ways in which the drawing procedures can be switched will now be described here.

According to certain exemplary embodiments, all of the utilities which support switchable drawing procedures will be called to “disconnect” all of the drawing procedures for each of the interface objects supported by that particular utility. In essence, this amounts to sending a dispose message to the drawing procedure for utility object elements currently in existence. The utility then is called to swap pointers 44 to the drawing procedures. For example, if window drawing procedure A is being replaced by window drawing procedure B, the window drawing utility will be asked to replace all of its references to procedure A with references to procedure B. This process will occur for each drawing procedure that is switched out. Lastly, every drawing procedure for every utility interface element should be sent an initialize message and the display will be completely redrawn.

According to other exemplary embodiments of the present invention, these drawing procedures can be data driven so as to allow each procedure to be able to support a wide variety of appearances and behaviors without modifying the code of the procedure itself. In this way themes can be switched without requiring that the drawing procedure code be switched. Each theme provides its own data structures which are supplied to the parametric drawing procedure. These exemplary embodiments will now be described in more detail.

According to certain exemplary embodiments of the present invention, system-provided drawing procedures map directly from existing procedures to provide compatibility with existing systems. For example, each individual drawing procedure will correspond to a conventional procedure (e.g., WDEF0, WDEF1, CDEF0, CDEF1). This mapping can be accomplished, for example, by the exemplary mapping procedure illustrated below in pseudocode form. This exemplary procedure can handle loading both conventional drawing procedures as well as the new drawing procedures.

OSErr MapDefprocReference(ResType defprocType, SInt16 defprocID, Handle *defprocHandle, SOMObject **ido) { OSErr result; // // First load the defprocType, defprocID resource // *defprocHandle = GetResource(defprocType,defprocID); // // If the resource came from the system, this identifies it as a stub and so get the corresponding ido pointer. // if (the Handle is a System Resource) { result = GetSystemIDO(defprocType,defprocID,ido); } else // // If the resource didn't come from the system, assume it's a // custom resource deproc and return a NULL ido pointer. // { result = noErr; *ido = NULL; } }

The first step, as seen above, is to determine the resource ID of the procedure being called. This will load either an old style procedure located in a resource chain or a stub resource from the system file. Stub resources are modules which, when invoked, decode a conventional procedure's message and call the corresponding new drawing procedure based on the decoded message. Thus, when a utility creates a new interface object using a drawing procedure it will also load an appropriate stub resource and store its value in a procedure handle field of the object's data structure. Since the utilities can switch the drawing procedure that they call, the ability to dynamically change the set of drawing procedures which create the interface objects is now available.

Data Driven Layout Engine

According to other exemplary embodiments of the present invention, the drawing procedures can be parametric in nature so that they need not be switched every time that a theme is changed. Instead, the data supplied to these procedures is changed with the theme. A discussion of data-driven layout engines according to the present invention begins with some background on window and menu definition objects.

Window and menu definition objects are modular pieces of code which define how window and menu interface elements look (i.e., are drawn on the screen) and react (e.g., respond to user mouse clicks). The following examples use window objects, however those skilled in the art will appreciate that other objects, e.g., menu objects, can be created using similar techniques. The system uses the window definition objects to provide graphical user interface interaction with a user. These definition objects can flexibly define windows in a variety of ways. For example, rectangular windows commonly seen in GUIs could relatively easily be replaced by round windows simply by writing a new window definition object.

There are several tasks that a window definition object typically performs. For example, the window definition object provides the capability to draw a window at any size anywhere on the screen. This code can also draw several different kinds of windows, such as windows with and without close boxes and zoom boxes, as well as dialog boxes and drawers. As mentioned above, replacing rectangular windows with round windows would conventionally require writing software (i.e., a new window definition object). One of the objects of exemplary embodiments of the present invention is to allow windows and menus to be changed without writing new code. Thus, there is described herein a single window definition object which evaluates data to determine how to perform tasks which were conventionally performed by various different window definition objects. The data can be changed to make windows look and act differently, rather than changing the code.

To obviate the job of creating new code for each new window, the data-driven (switchable) behavior of window objects is incorporated into a general data-driven layout engine according to the present invention. The layout engine receives data resources and performs a system-generated drawing primitive. These drawing primitives, which are described in more detail below, can for example, draw an object or parts of an object at any size and place on the display. The layout engine can also create a region which corresponds to any set of the object's parts. FIG. 5A is a block diagram depicting command and data connections between various layers according to exemplary embodiments of the present invention. Therein, a user interface 500 is illustrated as interacting, e.g., by way of application program interface (API) calls, with both a layout engine 510 and a window definition object 520.

When the window definition object 520 receives a command from the user interface 500 to draw a window, the window definition object 520 uses the drawing primitives, and appropriate data resources from resource manager 530, to instruct the layout engine 510 to draw a window. After the layout engine 510 is finished executing its assigned drawing primitive(s), the window definition object 520 may perform any remaining tasks with respect to drawing the window. For example, the layout engine 510 will not draw the window title if it is not provided with the text of this title. According to this exemplary embodiment, the window title is not passed from the window definition object 520 to the layout engine 510 to simplify communication. Nonetheless, the layout engine 510 has control over where the window title is drawn even if it doesn't draw the title itself, because the window definition object 520 will query the layout engine 510 for a region that corresponds to the window title text and then draw the title in that region. Other exemplary interactions between the layout engine 510 and window definition object 520 include the following.

To draw the outline of the window, e.g., when a window is being grown, the window definition object 520 asks the layout engine 510 for the region of the window's structure. The window definition object 520 calls a routine, e.g., from the drawing procedures 46, to draw the outline of the identified region.

The window definition 520 object can perform a test to determine if a user has activated, e.g., clicked on, a particular part of a currently displayed window by asking the layout engine 510 for all the regions of all the window sets. Sets correspond to areas of a window such as close boxes, drag regions and zoom boxes. The window definition object 520 can then call a routine which checks to see if a pointer has been activated in each region.

Drawing specific window elements, such as a size box or a highlighted window control, is performed by sending a drawing primitive from the window definition object 520 to the layout engine 510 identifying the part with its respective data resource.

Having described various exemplary functions which can be performed by the layout engine 510 upon command by the window definition object 520, two exemplary primitives which can be used to convey these commands will now be described. Exemplary syntax for a DrawLayout primitive and a RegionLayout primitive are set forth in Table 1 below.

TABLE 1 OSErr DrawLayout(UInt32 LayoutRef, Rect portRect, UInt16 Set, UInt16 Metavalues, UInt32 Attributes) OSErr RegionLayout(UInt32 LayoutRef, Rect portRect, UInt16 Set, UInt16 Metavalues, UInt32 Attributes, RgnHandle theRgn).

Each of these commands have certain parameters which are passed to the layout engine 510 from the window definition object 520. For example, the LayoutRef parameter is a pointer to the layout data. Several examples and more details regarding the layout data and its associated data structures are provided and discussed below. The window definition object 520 passes the location of the layout data from, e.g., the appearance management layer 40 of FIG. 4, to the layout engine 510 using the LayoutRef pointer.

The portRect parameter identifies a parent rectangle around which the layout engine 510 draws the parts on the display. The graphics subsystem 56 can specify the portRect parameter for every operation. The window definition object 520 receives the portRect parameter from the system and passes this parameter on to the layout engine 510.

The Set parameter identifies the set of parts which the layout engine 510 is to draw. There can be a predetermined number of possible sets defined for a window (e.g., 32 sets) which are predefined by the window definition object 510 for different regions. The menu definition object can define a different list of sets which would be used to draw menus. As an example, the window definition object can use the following sets associated with different regions of a window:

kSetTitleBar—draws the title bar at the top of the window.

kSetTextRgn—determines the area where the title text should be drawn.

kSetCloseBox—draws the window close box.

kSetZoomBox—draws the window zoom box.

kSetIconBox—determines the area where the window title icon should be drawn.

kSetCustomBox—determines the area where the custom icon should be drawn.

kSetDrag—determines the area where a user can click on the window to drag it.

kSetGrow—draws the window grow box.

kSetStructure—draws the structure of the window (for instance, the left and right sides and bottom).

kSetContent—determines the area where the content of the window is drawn.

The Metavalues parameter is an arbitrary length array of extra values which the window definition object 520 can define and which can then be used by the layout engine 510 to size the parts to be drawn on the display. For instance, the window definition object 520 can pass values such as the title text height and width in this array.

The Attributes parameter is a bit field of flags which are provided by the window definition object and are used to limit which parts are considered valid for a particular primitive. A list of parts, described below, is provided as part of the layout resources. The window definition object defines which flags are used in this field. For instance, the Attributes parameter can define the following bits: kAttributeHasGrowBox, kAttributeRightToLeftOrientation, kAttributeHasFullZoom, kAttributeHasCloseBox, kAttributeHasCustomGadgetIcon, kAttributeHasTitleText. An illustrative example will serve to highlight the functions and advantages of the Attributes parameter.

Suppose that the window definition object 520 called the DrawLayout primitive of Table I with Set equal to kSetTitleBar and Attributes equal to kAttributeHasCloseBox, kAttributeHasTitleText, kAttributeHasFullZoom, e.g., by setting bits in the mask associated with these attribute parameters equal to “1”. Then, the layout engine 510 would draw a title bar with a close box, title text and a zoom box. If the window definition object 520 subsequently called DrawLayout again with the same arguments (including a LayoutRef parameter which pointed to the same layout data) except that for this iteration Attributes equals kAttributeHasCloseBox and kAttributesHasCustomGadgetIcon, the layout engine 510 would draw a title bar with a close box and a custom gadget icon but with no zoom box or space for title text. The Attributes parameter provides added flexibility to the DrawLayout primitive such that the window definition object 520 can use a single layout resource to describe a variety of different windows which have different attributes.

As can be seen from the syntax in Table 1, the RegionLayout routine uses the same parameters as the DrawLayout routine plus an extra parameter, theRgn, which identifies the region which is returned. The purpose of the DrawLayout primitive is to draw something on the screen, while the purpose of the RegionLayout primitive is to create a region (shape) and return that region to the window definition object 520 so that the window definition object can operate on the region. For instance, the window definition object could then draw the outline of the region on the screen itself by calling a framing function from the graphics subsystem. Alternatively, the window definition object 520 could draw the window title at the spot on the screen specified by the region returned by RegionLayout.

To draw a window, the window definition object 520 loads the layout resource for the particular type of window which is to be drawn. Alternatively, the layout resources can be pre-loaded and simply pointed to by the window definition object 520 using the LayoutRef parameter. Then the window definition object 520 sets the Metavalues array to the correct values for the current window title height and width. Finally, the window definition object 520 calls the layout engine 510, for example by instructing:

DrawLayout(LayoutRef, portRect, kSetStructure, Metavalues, kAttributeHasCloseBox);

The foregoing command provides an example of a specific DrawLayout command. The parameter kSetStructure specifies to the layout engine 510 that the window definition object 520 wants the window's structure region drawn, e.g., the entire outline of the window including the title bar, the close box, zoom box and title text region. By specifying the parameter kAttributeHasCloseBox the window is drawn by the layout engine 510 with a close box (and without a zoom box, etc., since other Attributes are not specified in the drawing primitive).

Having provided an overview of how data-driven layout engines operate according to the present invention, a more detailed description of layout resources will now be provided. A layout resource is a data structure which includes a list of boundaries and parts. The boundaries contain the information regarding the location on the display in which the parts should be drawn relative to a reference shape, e.g., parent rectangle. The parts contain the information about which pattern is drawn in each part rectangle. There can be any number of boundaries and any number of parts in each layout resource. The following is an exemplary data structure for a layout resource.

struct ThemeLayout{ UInt16 version; UInt32 reserved; UInt16 boundaryCount; ThemeBoundary boundary[1]; UInt16 partCount; ThemePart part[1]; };

The version parameter provides version control to allow a theme designer to indicate for which version of the layout engine this particular layout resource was created. The reserved parameter is a place holder for future functionality. The boundaryCount parameter indicates how many ThemeBoundary data structures follow in the list.

Exemplary ThemeBoundary data structure implementations for providing boundary information in the layout resource data made available to the layout engine by the drawing primitive will now be discussed. For example, a single boundary having a fixed length structure can take the format described below.

struct ThemeBoundary { UInt16 offsetType; SInt16 value; SInt16 startBoundary; UInt16 limitType; SInt16 limit; SInt16 LimitBoundary; };

As mentioned previously, each boundary is placed on the screen relative to any of the previously placed boundaries. In the above example, the startBoundary parameter specifies the relative position and orientation of the new boundary. For example, if startBoundary is a horizontal boundary, then the new boundary will be a horizonal boundary also.

The offsetType parameter can have one of the following values: kOffsetConstant, kOffsetMetaValue, and kOffsetCenter. The value parameter has different meanings depending on what value the parameter offsetType takes. Specifically, if the offsetType parameter is kOffsetConstant, then the value parameter is a positive or negative number which is added to the startBoundary location to obtain the current boundary location. For example, to create a new boundary which is six pixels to the right of the left side of the parent rectangle, one could specify the left side of the parent rectangle as the startBoundary, set offsetType to be kOffsetConstant, and give the value parameter a value of six. In the alternative, to create a new boundary which is six pixels to the left of the right side of the parent rectangle, one could specify the right side of the parent rectangle as the startBoundary, set offsetType to be kOffsetConstant, and give the value parameter a value of negative six.

If the offsetType parameter is specified as kOffsetMetaValue, then the value parameter functions as an index into the MetaValues array which was passed to the layout engine 510, by the window definition object 520. The absolute value of the value parameter is used to index the array. However, if the value parameter is negative, then the value stored in the MetaValues array at the index ABS (value) is negated before it is used. The value retrieved from the array (or its negative) is then added to the startBoundary parameter to obtain the new boundary location as in the previously discussed case where offsetType was set to kOffsetConstant. If the offsetType is kOffsetCenter, then the value parameter is ignored, and the new boundary is placed halfway between the startBoundary and the limitBoundary.

Once the boundary has been placed using the above rules, the location can be further modified by limit restrictions as defined by the limitType parameter value. If the offsetType parameter is kOffsetCenter or the limitType parameter is kLimitNone, then the limit parameters have no effect on the boundary position, so the next boundary to be placed is processed. If the offsetType parameter is not kOffsetCenter and the limitType parameter is not kLimitNone, then the new boundary location can be modified based on the value of limitType, which can have, for example, any of the following values: kLimitNone, kLimitPinToLimit, LimitPinToStart, kLimitPinToLimitPeriod, and kLimitPinToStartPeriod.

If the limitType parameter is kLimitPinToLimit or kLimitPinToStart then this exemplary technique will consider the limitBoundary parameter, which is another of the previously positioned boundaries. An exemplary diagram which portrays relationships between exemplary boundaries is provided as FIG. 5B. The limitBoundary limits movement of the new boundary 572. An offset constant, for example, limit in FIG. 5D (which can be positive or negative), defines an offsetlimitboundary 574. The value of limit can be zero, in which case, offsetlimitboundary 574 and limitBoundary 570 would be the same. If the new boundary is to be placed in a position such that it has moved from the startBoundary to its new position and passed the offsetlimitboundary, then it will be constrained based on the value of limitType. If the limitType parameter is set to kLimitPinToLimit then the new boundary 572 will be moved to be in the same place as the limitBoundary 570. If limitType is kLimitPinToStart then the new boundary will be moved to be in the same place as the startBoundary 576. Of course, if the new boundary would not pass the offsetlimitboundary when it is placed, as is the case for new boundary 572 in FIG. 5B, its original placement will remain unchanged.

Two other values which the limitType parameter can take are kLimitPinToLimitPeriod and kLimitPinToStartPeriod. These are similar to the other two values of limitType except that they provide a series of offsetlimitBoundaries spaced periodically. The new boundary is then moved to the closest offsetlimitboundary which is either in the direction of the startBoundary or the limitBoundary depending on the value of limitType as kLimitPinToStartPeriod or kLimitPinToLimitPeriod, respectively. An example of this type of boundary placement is illustrated in FIG. 5C, wherein the offsetlimitBoundaries are placed at equal spacings of limit from the limitBoundary. For instance, the first offsetlimitboundary 580 is limit pixels to the left of limitBoundary 582. The second is limit pixels to the left of the first offsetlimitboundary 580. The third offsetlimitBoundary 586 is limit pixels to the left of the second offsetlimitboundary 584, etc. There is also another string of these offsetlimitBoundaries to the right of limitBoundary 582 as represented by offsetlimitBoundary 588. For the value shown in FIG. 5C, the new boundary 590 will be placed at offsetlimitBoundary 584 if limitType is equal to kLimitPinToStartPeriod or at offsetlimitboundary 580 if limitType is equal to kLimitPinToLimit. An example of how the boundaries determine the visual appearance of objects and object parts is provided below with respect to FIG. 5D.

Having described how boundaries can be structured in a layout resource, part structures will now be described. Each layout resource will include any number of parts as specified by the partCount parameter in the layout data. According to this exemplary embodiment, a part can be a fixed length structure having the following general form.

struct ThemePart { UInt32 inclusionAttributes; UInt32 exclusionAttributes; UInt32 regionSet; SInt16 top; SInt16 left; SInt16 bottom; SInt16 right; OSType fillType; SInt16 fillID; UInt16 fillAnchor; };

Each of the exemplary part parameters shown above will now be described below.

The inclusionAttributes and exclusionattributes masks allow the part to specify that it should be drawn only when a certain attribute bit (e.g., kAttributeHasCloseBox) is present, or that it should be drawn only when a certain attribute bit is not present. There may be many bits set in each mask. As an example, if a certain bit (e.g., kAttributeHasCloseBox) is not set in either the inclusionAttributes mask or the exclusionAttributes mask of a particular part in a set to be drawn, then that part is present regardless of whether the layout engine is drawing a window with a close box or not. If the bit is set only in the inclusionAttributes mask, then that part will only be drawn if the window has a close box. If the bit is set only in the exclusionAttributes mask, then that part will only be drawn if the window does not have a close box. It is illegal to have a particular bit set in both the inclusionAttributes and exclusionattributes masks.

The regionSet parameter specifies to which sets a part belongs. A single part may be a member of many sets. For example, if a single layout resource is to define how a window should look both with and without a close box, the layout resource would then contain at least two parts. One part would draw a close box pattern and have the kAttributeHasCloseBox bit in inclusionAttributes marked. Another part would be a filler pattern which would be drawn in place of the close box and have the kAttributeHasCloseBox bit in exclusionSet marked. Both of these parts could have the bit marked in their regionSet masks indicating that they are a member of the kSetCloseBox.

The top, left, right and bottom parameters can be index numbers into the boundary array which is described above or they can be special numbers referencig the parent rectangle. The four boundaries form a rectangle which defines a location at which the part should be drawn on the display. The boundaries are placed on the display relative to the parent reference rectangle specified by the function call in the portRect parameter.

The fillType and fillID parameters specify how the part should be painted. For example, the fill could be a color pattern. The fillAnchor parameter specifies how the fill pattern should be oriented with respect to the part. This parameter can take, for example, one of the following values: kAnchorNone, kAnchorTopLeft, kAnchorTopRight, kAnchorBottomLeft, and kAnchorBottomRight.

For instance, if the part rectangle was too small for the fill color pattern, a value of kAnchorTopLeft would indicate that the color pattern should be clipped on the bottom and right. Also, if the part rectangle is sufficiently large that the fill icon is to be tiled (i.e., repeated) to fill the entire part rectangle, a value of kAnchorTopRight would indicate that the boundaries of the tiled color patterns should line up with the top and right boundaries of the fill rectangle.

This exemplary data structure for the layout resource allows the layout engine 510 to operate efficiently. For example, according to this exemplary embodiment of the present invention, a layout resource is specified so that the parts are redrawn correctly when the parent rectangle changes size. For instance, if a window is reduced in size, the graphics designer may want the title bar racing stripes in the window title bar to get shorter while maintaining the full title text width. This is shown in FIG. 5D by way of title bars 550 and 552. Once the window gets smaller than a certain size, however, the title text should be clipped while the length of the title bar racing stripes remains constant as illustrated by title bars 554 and 556.

This type of functionality is provided by the layout boundaries described above. Consider the boundaries 560, 562, 564 and 566 illustrated in FIG. 5D. These boundaries are specified in the layout resource for this title bar. Boundaries 560 and 562 limit how short the racing stripes can become. Boundaries 564 and 566 are centered about 568 to define the title bar text area. When the title bar shrinks to the size of title bar 552, the limit boundaries 560 and 562 have not been exceeded by boundaries 564 and 566, so the title bar text area is unaffected. However, when the title bar shrinks to the size 554, the limit boundaries 562 and 564 become the boundaries 564 and 566 of the text area and force the text to be clipped.

The layout boundaries for each part identified in the layout resource can be placed on the display relative to the parent rectangle according to the exemplary embodiment illustrated by the flowchart of FIG. 5E. When the layout engine is called to either draw or create a region, it first places the boundaries as shown by block 560. The location of the boundary can be calculated and stored so that when a part is drawn relative to the boundary, the part can be drawn on the screen in the right place but the boundaries themselves are not drawn on the screen.

Of course, the boundaries should be determined quickly and can, for example, be placed linearly one at a time starting at the beginning of the boundary list. All of the boundaries can be placed on the screen every time the layout engine 510 is called by the window definition object 520. Additionally, the boundary positions can be cached so that in certain circumstances, e.g., when the layout engine 510 is called with repeated parameter values such that the boundaries are in the same place the second time, the old boundary positions can be recalled from memory, which is faster than placing all the boundaries on the screen again. New boundaries are placed on the screen relative to the existing boundaries. When the first boundary is placed, the parent rectangle has already been placed on the screen thus, the four sides of the parent rectangle can be considered to correspond to boundaries having, for example, indices −1, −2, −3 and −4.

Once the boundaries are placed, then the parts list is traversed beginning with a first indexed part at block 562. Then, at decision block 564, the layout engine checks to see if the part is a member of the set which is currently being drawn by evaluating the aforedescribed regionSet parameter of that part. If not a member of the set, then the part is not drawn and the flow returns to block 562 to evaluate the next part in the layout resource. If the part is a member of the set being drawn, following the “Yes” branch in FIG. 5E, then the attributes are checked at block 566 to see if the part is valid. If either the inclusionAttributes or exclusionattributes mask specifies that the part is invalid, it is ignored. If the part is a member of the correct set and it is valid, then the part is drawn where its four previously placed boundaries specify at block 568. A significant feature of the data structures described above is that they are organized as a list of boundary parameters and part parameters which can be traversed once by the layout engine 510 to create the associated object. This provides benefits in terms of execution speed when rendering objects on the user interface.

To further describe how exemplary embodiments of the data driven layout engine operate, a simplified numerical example of layout data which can be used by the layout engine 510 according to the present invention is provided below where the values, in order, represent:

Description Value version number 0 reserved 0 boundary count 2 kOffsetCenter - boundary 1 3 value (ignored in this case) - boundary 1 0 1st boundary - boundary 1 −1 limitType (ignored in this case) - boundary 1 0 limit (ignored in this case) - boundary 1 0 2nd boundary - boundary 1 −3 kOffsetConstant - boundary 2 1 value - boundary 2 10 startBoundary - boundary 2 1 klimitPinToLimit - boundary 2 2 limit - boundary 2 5 limitBoundary - boundary 2 −3 part count 1 kAttributeHasCloseBox inclusionAttributes 1 kAttributeHasZoomBox exclusionAttributes 8 contentRgn & structureRgn regionSet 3 top 1 left −2 bottom 2 right −4 filltype ’plut’ fillID 5 kAnchorTopLeft 2

This simplified resource can be used to draw a rectangle, one edge of which is centered in the parent rectangle. The rectangle is 10 pixels wide and its other edge is limited to five pixels.

According to further exemplary embodiments, layout engine speed is increased since it will frequently be in use in the user interface. One of the slowest operations in many systems, e.g., the Macintosh computer system, is allocating memory. Unfortunately, memory is frequently allocated when regions are being created, for example, when windows are drawn on the user interface. Thus, two additional features can be provided to the layout engine 510 to give the window definition object 520 the capability to perform rendering operations without having to create regions.

For example, it was stated above that the window definition object 520 can query the layout engine 510 for the region which corresponds to the window title text so that after the layout engine has drawn the window, the window definition object can draw the title text in the correct location. However, the window definition object 520 only needs to know the rectangle into which it should draw the title text, not the region since a region can be any shape, not just rectangular. Thus, an additional command call can be provided which is similar to RegionLayout described above except that it returns a rectangle which encloses the desired set. An exemplary format for this call is described below.

OSErr RectLayout(UInt32 theLayoutRef, Rect portRect, UInt16 Set, UInt16 Metavalues, UInt32 Attributes, Rect *bounds);

The second category of data structures used in the data driven structural procedure relate to interface objects' behaviors. Each behavior is associated with transitions between different states or values of controls in the interface and can be expressed by changes in visual or audio output that correspond to these transitions.

Data driven drawing procedures can use a common mechanism that implements state tables. These state tables contain bitmaps or glyphs for each state of the control represented thereby as well as information about transitions from one state to another. Each transition may contain one or more of, for example, an animation sequence, a sound or a routine to implement a custom transition, e.g., an algorithmic display or any other type of transitional effect. By defining state diagrams for each object and object part of the user interface, a template can be created that allows a theme designer to place customized glyphs for each state of the control and also to customize the transitions between states of the control as desired. An exemplary state diagram is shown as FIG. 6 which provides an example of the possible states and most common state transitions for a checkbox control of a window object.

As seen in FIG. 6, this exemplary checkbox has nine possible states which can be displayed. These states include three highlighted states for each of the control's three values. In normal use, when a user clicks on an unchecked checkbox (state Q1), this action moves the control to its pressed state (state Q4). After the mouse is released, the control returns back to its original state (state Q1) and the application is notified of the button which has been pressed. The application then switches the value of the control to its new value, which might be checked (state Q2).

In data driven themes according to the present invention, a resource exists for each of the customizable controls to allow the theme designer to plug in new glyphs or bitmaps for each of the states of the control. Moreover, to provide more flexibility to customize transitions between states and a control state table, a matrix for these transitions can be provided. Note for example the exemplary matrix illustrated in FIG. 7. For each block in the matrix, a theme designer can provide a visual and/or audio output such as an animation, sound, a custom transition procedure which can perform some type of algorithmic transition, e.g., a kaleidoscopic display or any combination thereof. Of course, not every box in the transition matrix need be filled in by the theme designer and where no transition behavior is specified, or if the theme does not specify a special transition behavior, the control moves directly to the glyph or bitmap that is specified for the new state without any transitional effect.

Although the foregoing two exemplary embodiments describe switching either the code or the data of the drawing procedures, those skilled in the art will appreciate that both schemes can be implemented in the same interface. For example, it may be advantageous to generate certain themes, e.g., themes using relatively simple patterns, by way of hard-coded drawing procedures to provide a speedy redrawing of the interface. Similarly, where a theme is, for example, relatively more complicated graphically, it may be advantageous to generate such themes using the aforedescribed data-driven drawing procedures. Accordingly, since many different types of themes are available for user selection, it is anticipated that both of the above-described exemplary embodiments can be deployed in the same interface and the switchable pointers will then either point to the appropriate hard-coded procedure or to the parametric drawing procedure.

Custom drawing procedures can inherit from the system provided appearance using a form known as delegation or forwarding. Delegation involves passing control on to another object when inherited behavior is desired. To determine the particular object to which the drawing procedure should delegate in a dynamically changing interface, either the client can call in to the system or the system can track current implementations. According to exemplary embodiments, this burden can be placed on the system by providing an additional layer of redirection. As seen in FIG. 8, the utility 61 calls the custom drawing procedure 63. The drawing procedure 63 inherits from the switcher 65 which delegates to the appropriate implementation 67 or 69. An example of this type of inheritance will now be described using menu drawing procedures.

A theme can provide a menu drawing procedure which controls drawing standard menus for that theme for example, a theme may only change the appearance or behavior of a single item in the menu while letting the remaining menu items appear and behave as they do when the system default theme is in control. By creating a custom menu drawing procedure that inherits from the system menu drawing procedure, i.e., from the switcher object, the application can intercept the command to draw a menu item from the utility issuing the command. If the menu item to be drawn is an item whose appearance and/or behavior has been customized by the theme, then the theme's menu drawing procedure can be used to draw that item. Otherwise, the inherited code pointed to by the switcher object can be called to draw the item. In this particular example, where the theme only customizes one menu item, the theme's custom menu drawing procedure only overrides the system to draw that item, with any other items being drawn using the inherited code.

Pattern Look-up Tables and Drawing Support

The following discussion relates to the subject matter described in the above-referenced U.S. Patent Application entitled “Pattern and Color Abstraction in a Graphical User Interface. ” The following is a more detailed description of the pattern look-up table mechanism 48. As described above, since one of the objects of the present invention is to provide interfaces which facilitate user control over the appearance of the desktop, the themes used by the appearance management layer 40 should be able to operate on a variety of color data to draw the interface, e.g., a color pattern, a pattern defined on a pixel-by-pixel basis, bitmapped image or the like, etc. The pattern tables provide a system and method for specifying this color data, so that the theme color set can be edited independently of the theme using resource-editing utilities. The pattern tables provide this support by abstracting the notion of pen pattern and color, allowing an application or theme to draw interface pieces without being locked to a particular color set.

This functionality is provided according to exemplary embodiments of the present invention by a mechanism including a pattern look-up table. An index in a pattern look-up table references data for a color, a pattern defined on a pixel-by-pixel basis, bitmapped image or the other data, so that the client need not know anything about the datatype contained in the pattern look-up table entry. The significance of this data independence is that a theme having solid-colored windows, for example, can be changed to instead draw the windows in a complex pattern, without changing the theme source code simply by editing the table entries. When reference is made below to the terms “pattern” or “patterns”, it is intended to denote any type of graphic data that can be used in a pattern look-up table to draw in a graphics port. As such, this may be a solid color defined in terms of its red, green and blue (RGB) components, or a pattern defined on a pixel-by-pixel basis, e.g. a PixPat, or a new type of data.

Before discussing the various features of the pattern table routines in great detail, an overview of how color and pattern abstraction can be provided according to an exemplary embodiment will be described with reference to FIG. 9. Therein a client 60 sends a command ThemeFillRect (kColorIndex) to the appearance management layer. This command is one of a set of drawing primitives implemented by the appearance management layer 40. In this particular example, it is a command to draw a rectangle that is filled with the pattern specified as kColorIndex. The value of kColorIndex corresponds to a predetermined object or object part on the desktop. For example, index 3 might correspond to the window title color. However, note that the client 60 need have no knowledge of the particular color which is currently being implemented as the window title color, but only the absolute index which identifies that color.

The kColorlndex parameter has a corresponding entry in the part index table 62. This entry maps into the theme pattern look-up table 64. As described previously, the entries in the theme pattern look-up table 64 can include any type of color or pattern data in any format. For the purposes of this example suppose that the entry in the part index table corresponding to the value of kColorIndex maps into a pattern called ‘xpat’ referring to a black and white criss-cross pattern. ‘Xpat’ has a corresponding entry in the pattern definition procedure table 66 where the procedure for drawing this black and white criss-cross pattern is located. This table includes a procedure pointer 68 which translates the commands defined by the ‘xpat’ record into commands which are recognized by the graphic subsystem 56 used by the system to draw the pattern onto the display. These commands are then sent to the graphic subsystem which displays the pattern at the appropriate point on the desktop interface.

Although the exemplary embodiment illustrated in FIG. 8 portrays the client as using drawing primitives to send commands through the appearance management layer to the graphic subsystem, other exemplary embodiments of the present invention operate in a somewhat different fashion. According to this exemplary embodiment, the appearance management layer 40 does not command the graphic subsystem 56, but simply acts essentially as a pattern/color database. For example, in the exemplary block diagram of FIG. 10, a get theme pattern command is sent to the appearance management layer 40, instead of the drawing primitive in FIG. 8. The appearance management layer returns a pattern structure which can be rendered by the graphic subsystem in the currently implemented theme for the particular interface object or object part requested in the get theme pattern command, to the client which then sends its own command to the graphic subsystem to draw the appropriate pattern and/or color on the desktop interface. This alternate exemplary embodiment also has the benefits described herein with respect to abstracting the pattern/color combination from the interface.

Thus, through the use of pattern tables, the color and/or pattern of desktop objects can be readily switched from one theme to another by changing the values in the part index table 62 and/or the pattern look-up table 64. This switching of patterns is totally transparent to the application. As a result, new patterns can be added without any need to change the application itself. Having now described an overview of pattern and color abstraction according to the present invention, a more detailed description of exemplary routines for implementing the above will now be provided.

The appearance management layer, according to certain exemplary embodiments, recognizes a set of drawing primitives which can be, for example, derived from those used by the system's graphic subsystem (for example, QuickDraw). These primitives can have the same calling sequence as their counterparts in the graphic subsystem, but use indices into the theme pattern table to specify the color and/or pattern details of the requested drawing command. Exemplary drawing primitives are illustrated below along with descriptions in italics.

typedef unsigned char OSType [4]; typedef short SInt16; typedef unsigned short UInt16; typedef unsigned long UInt32; typedef UInt16 ThemePartIndex; pascal OSErr ThemeSetPen (ThemePartIndex); Sets the pen pattern to the contents of the specified index of the theme pattern look-up table. pascal OSErr ThemeFrameRect (ThemePartIndex, Rect *r); pascal OSErr ThemeFillRect (ThemePartIndex, Rect *r); Fills or frames the rectangle with the contents of the specified index. pascal OSErr ThemeFrameRoundRect (ThemePartIndex, Rect *r, radius); pascal OSErr ThemeFillRoundRect (ThemePartIndex, Rect *r, radius); Fills or frames the round rectangle with the contents of the specified pattern index. pascal OSErr ThemeFrameOval (ThemePartIndex, Rect *r); pascal OSErr ThemeFillOval (ThemePartIndex, Rect *r); Fills or frames the oval with the contents of the specified pattern index. pascal OSErr ThemeFramePoly (ThemePartIndex, PolyHandle); pascal OSErr ThemeFillPoly (ThemePartIndex, PolyHandle); Fills or frames the polygon with the contents of the specified pattern index. pascal OSErr ThemeFrameRgn (ThemePartIndex, RgnHandle); pascal OSErr ThemeFillRgn (ThemePartIndex, RgnHandle); Fills or frames the region with the contents of the specified pattern index.

The appearance management layer can also define a set of bevel, text and dialog grouping rectangle primitives which can be used by clients for drawing bevels and dialog group rectangles in a standard appearance. The implementations of these routines can be overridden by the theme to generate special appearances. For this reason, the client should not draw bevels independent of the appearance management layer for user interface object parts, but should instead use the provided primitives. Exemplary primitives are shown and described below.

pascal OSErr ThemeDrawBevel (Rect *pBevelRect, Boolean fbutton); pascal OSErr ThemeDrawInsetBevel (Rect *pBevelRect, Boolean fbutton); Draws a bevel into or out of the background. if jbutton is set, then the bevel corners are left out, resulting in a standard ’beveled button‘ visual. pascal OSErr ThemeDrawDeepBevel (Rect *pBevelRect, Boolean fbutton); pascal OSErr ThemeDrawDeepInsetBevel (Rect *pBevelRect, Boolean fbutton); Draws a deep bevel into or out of the background. pascal OSErr ThemeDrawInsetTextFrame (Rect *pTextFrame); Draws the standard inset text frame which is used for edit text items in dialogs. pascal OSErr ThemeDrawRidge (Rect *pRidgeRect); pascal OSErr ThemeDrawInsetRidge (Rect *pRidgeRect); Draws a ridge frame into or out of the surface. pascal OSErr ThemeDrawEmbossedString (StringPtr, scriptcode); pascal OSErr ThemeDrawInsetString (StringPtr, scriptcode); Draws a string embossed out of or inset into, the surface. pascal OSErr ThemeDrawShadowedString (StringPtr, scriptcode); Draws a string with a shadow. pascal OSErr ThemeMeasureEmbossedString (StringPtr, scriptcode, Rect); pascal OSErr ThemeMeasureInsetString (StringPtr, scriptcode, Rect *); pascal OSErr ThememeasureShadowedString (StringPtr, scriptcode, Rect); Measure the size of the string when embossed. pascal OSErr ThemeDrawGroupingRect (Rect *pGroupRect, str255grouptitle); Draws a dialog item grouping rect with the specified title. An empty or nil title may be passed and no title will be drawn. pascal OSErr ThemeDrawSeparatorLine (Int16 length, Boolean fvertical); Draws a horizontal or vertical separator line.

Pattern look-up tables are provided as part of the package which handles drawing requests, either with the aforedescribed drawing primitives or alone, which tables will now be described in somewhat more detail.

A pattern data structure holds the data necessary to draw a pattern. It can have, for example, the following structure:

typedef UInt32 PatternData [2];

typedef PatternData *PatternDataPtr;

The pattern data structure can be, for example, an eight-byte structure used to store pattern and/or color information. If the data required for the pattern is more than eight bytes long, it can be stored in a handle and the handle placed in the pattern data structure. A pattern definition procedure, described below, is a component which is responsible for the loading and interpretation of a pattern data structure.

The pattern look-up table specifies the list of colors and patterns used by a theme. A pattern look-up table contains a list of records, e.g., Pattern Spec record ‘xpat’ in FIG. 9, each of which is typed and references a specialized procedure to load, unload and draw.

Data encapsulation within a pattern look-up table entry is accomplished through use of a pattern definition procedure, a code module responsible for loading, unloading and interpreting a pattern look-up table entry's data, e.g., the pattern definition procedure ‘xpat’ of block 66 in FIG. 9. New pattern types may be defined by a theme for specific needs, such as algorithmic color and pattern generation, simply by adding new pattern definition procedures. A pattern definition procedure can be defined, for example, as a code fragment module or a dynamically loaded library which exports a list of entrypoints as set forth below. The default behavior for unimplemented entrypoints is to return an error.

OSErr PatDefOpen (OSType *pPatternType); Called when the pattern def is initially loaded, to allow the procedure to initialize state data. *pPatternType should be set to an OSType denoting the pattern type it will handle, for example ’xpat’ or ’ppat’. OSErr PatDefClose ( ); Called when the pattern def is no longer needed, to allow release of state data. OSErr PatDefLoadData (PatternDataPtr, Int16 id, Int16 index); Load the data associated with this pattern from a resource, and place the data in the PatternData record pointed to by PatternDataPtr. OSErr PatDefSetData (PatternDataPtr, PatternDataPtr newdata); Set the pattern data to a copy of that located in newdata. OSErr PatDefFreeData (PatternDataPtr); Free the data in the PatternData record pointed to by PatternDataptr. OSErr PatDefSetPen (PatternDataPtr); Set the port's pen to draw with the pattern. OSErr PatDefDefFrameRect (PatternDataPtr, Rect *); OSErr PatDefFillRect (PatternDataPtr, Rect *); Fill or frame the rectangle. OSErr PatDefFrameRoundRect (PatternDataPtr, Rect *, UInt16 w, UInt16 h); OSErr PatDefFillRoundRect (PatternDataPtr, Rect *, UInt16 radius); Fill or frame the rounded rectangle. OSErr PatDefFrameOval (PatternDataPtr, Rect *prect); OSErr PatDefFillOval (PatternDataPtr, Rect *prect); Fill or frame the oval contained in the rect. OSErr PatDefFramePoly (PatternDataPtr, PolyHandle hpoly); OSErr PatDefFillPoly (PatternDataPtr, PolyHandle hpoly); Fill or frame the polygon. OSErr PatDefFrameRgn (PatternDataPtr, RgnHandle rgn); OSErr PatDefFillRgn (PatternDataPtr, RgnHandle rgn); Fill or frame the Range.

Pattern look-up tables may be created in memory by applications to allow them the benefits of a pattern look-up table within the application. An exemplary application program interface (API) for creating pattern look-up tables is described below.

typedef void *PatternTableRef; typedef UInt16 PatternIndex; pascal OSErr NewPatternSpecTable (PatternTableRef*); pascal OSErr DisposePatternSpecTable (PatternTableRef); Creates and Disposes a PatternSpecTable. pascal OSErr AddPatternSpecToTable (PatternTableRef, OSType patternkind, PatternDataPtr pdata, PatternIndex *pindex); Adds a new pattern spec to a PatternSpecTable. Patterns are always added to the end of the table. The index at which the pattern is placed is returned in pindex. pascal OSErr GetPatternIndexType (PatternTableRef, PatternIndex, OSType *patternkind); Returns the type of pattern located in the specified index of the table. pascal OSErr SetPatternSpecData (PatternTableRef, PatternIndex, OSType patternkind, PatternDataPtr pdata); Set the pattern spec at the specified index to contain the specified data. pascal OSErr PatternTableSetPen (PatternTableRef, PatternIndex); Sets the pen pattern to the contents of the specified index of the theme pattern look-up table. pascal OSErr PatternTableFrameRect (PatternTableRef, PatternIndex, Rect *r) pascal OSErr PatternTableFillRect (PatternTableRef, PatternIndex, Rect *r); Fills or frames the rectangle with the contents of the specified index. pascal OSErr PatternTableFrameRoundRect (PatternTableRef, PatternIndex, Rect *r, radius); pascal OSErr PatternTableFillRoundRect (PatternTableRef, PatternIndex, Rect *r, radius); Fills or frames the round rectangle with the contents of the specified pattern index. pascal OSErr PatternTableFrameOval (PatternTableRef, PatternIndex, Rect *r); pascal OSErr PatternTableFillOval (PatternTableRef, PatternIndex, Rect *r) Fills or frames the oval with the contents of the specified pattern index. pascal OSErr PatternTableFramePoly (PatternTableRef, PatternIndex, PolyHandle); pascal OSErr PatternTableFillPoly (PatternTableRef, PatternIndex, PolyHandle); Fills or frames the polygon with the contents of the specified pattern index. pascal OSErr PatternTableFrameRgn (PatternTableRef, PatternIndex, RgnHandle); pascal OSErr PatternTableFillRgn (PatternTableRef, PatternIndex, RgnHandle); Fills or frames the region with the contents of the specified pattern index.

Themes can also define new pattern types to take advantage of special theme-specific behavior, such as algorithmically defined patterns. To do this, the theme provides a resource defining the pattern type or registers a code fragment module or dynamically loaded library using, for example, the InstallPatternDefinition command described below. The pattern definition procedure will be added to the internal type list of the system, and will be called directly to load, unload and draw patterns of the corresponding type. This code can be stored as a code fragment module or dynamically loaded library, and remains loaded as long as there are pattern look-up table entries which reference its type. For this reason, pattern definitions can remain installed even after the theme which created the pattern is unloaded in case these definitions are used by other applications.

pascal OSErr InstallPatternDefinition (ConnectionID cfmConnection); Install the specified pattern definition in a pattern handler list. If a handler for that type has already been installed, an error is returned. The pattern definition's type (as returned by PatternDefGetType) should be unique, and the PatternDef is locked and loaded in the system heap.

When a pattern definition procedure is installed, it can be added to an internal pattern definition table. For speed, these pattern definition procedures can be referenced by index rather than type in the pattern look-up table. When a new pattern is added to the pattern look-up table, the pattern definition table is scanned and the index of the definition for the pattern type is inserted into the record for the new pattern. As new types are added, they can be added at the end of the list.

When a new pattern definition procedure is added to the internal pattern definition table, a list is built which includes the exported pointers contained in the pattern definition. If any standard pointers are not defined, they are set to a default pointer which simply returns an unimplemented error. As discussed above with reference to FIG. 9, when a pattern is drawn, the pattern is found in the pattern look-up table and its corresponding pattern definition procedure is located, then the desired function pointer is called.

An example of a pattern definition procedure is shown below, which procedure is used to get a pattern defined on a per pixel basis from the look-up table and command the graphic subsystem to draw same.

// structure for interpreting contents of our PatternData struct typedef struct { PixPatHandle hPixPat; UInt32 unused; // PatternData struct is 8 bytes, pad to fit } PixPatData, *PixPatDataPtr; OSErr PatDefOpen (OSType *pPatternType) { *pPatternType = ’ppat’; // return type *pRefCon = (RefCon) 0; // no refcon used return noerr; } OSErr PatDefClose ( ) { return noerr; } OSErr PatDefLoadData (PixPatDataPtr *pdata, Int16 id, Int16 index) { pData−>hPixPat = GetPixPat (id); if (pData−>hPixPat == nil) return MemError( ); return noerr; } OSErr PatDefFreeData (PixPatDataPtr *pdata) { DisposePiXPat (pData−>hPixPat); return noerr; } OSErr PatDefSetData (PixPatDataPtr *pdata, PixPatDataPtr *pNewData) { if (!pData−>hPixPat) { NewPixPat (&pData−>hPixPat); if (!pData−>hPixPat) return QDError ( ); CopyPixPat (pNewData−>hPixPat, pData−>hPixPat); return noerr; } OSErr PatDefSetPen (PixPatDataptr *pdata) { PenPixPat (pData−>hPixPat); return noerr; } OSErr PatDefFrameRect (PixPatDataPtr *pdata, Rect *prect) { FrameCRect (pData−>hPixPat); return noerr; } OSErr PatDefFillRect (PixPatDataPtr *pdata, Rect *prect) { FillCRect (pData−>hPixPat); return noerr; }

The appearance management layer also defines a range of common pattern indices that can be included in each theme's pattern look-up table so that these indices are available to all clients. These include the set of patterns used to generate bevels and groups, along with other useful patterns, for example, the current background of the menu bar. The current background of the menu bar index may be passed to one of the standard theme drawing routines to draw shapes in the menu bar color. Below, for illustration purposes, an exemplary set of such common pattern indices is defined.

enum { // standard beveling colors kBevelBackgroundlndex = 0, kBevelFrameIndex, kBevelFaceIndex, kBevelShadowIndex, kBevelHiliteIndex, kBevelCornerIndex, kBevelAuxShadowIndex, kBevelAuxHiliteIndex, kBevelAuxCornerIndex, kBevelHiliteCorner, kBevelShadowCorner, kInvBevelFrameIndex, kInvBevelFaceIndex, kInvBevelShadowIndex, kInvBevelCornerIndex, kInvBevelHiliteIndex, kInvBevelAuxShadowIndex, kInvBevelAuxCornerIndex, kInvBevelAuxHiliteIndex, kInvBevelHiliteCorner, kInvBevelShadowCorner, // text frames kTextFrameFillIndex, kTextFrameFrameIndex, kTextFrameHilightIndex, kTextFrameShadowIndex, // standard ridge and group indices kGroupHilightIndex, kGroupShadowIndex, kGroupCornerIndex, kGroupTextIndex, kRidgeHilightIndex, kRidgeShadowIndex, kRidgeCornerIndex, kRidgeAuxCornerIndex, // beveled - shadowed text kTextIndex, kTextShadowIndex, kTextHilightIndex, kTextCornerIndex, // custom kThemeCustomRangeStart = 16384 }; typedef UInt16 ThemePatternIndex;

In addition to these exemplary defined types, a theme may define additional types which are used internally. These additional types can be indexed sequentially starting from whatever next highest index is available, e.g., 16384 in the example given above.

The following illustrates three exemplary pattern types which can be defined for usage in the appearance management layer. Therein, the command RGBColor specifies a red, blue or green color combination with which to draw an object or object part. ColorPattern describes a two-color 8×8 pixel pattern with a fore and backcolor, each specified with an RGBColor. An exemplary definition of a ColorPattern type is shown below:

typedef struct { RGBColor forecolor; RGBColor backcolor; Pattern pattern; }

A PixPat type specifies an arbitrary pattern defined on a per-pixel basis, wherein a designated area may be filled or drawn with the pattern contents by the graphics subsystem. The PixPat (Pixel Pattern) data structure is defined by the graphics subsystem, and is used to contain this per-pixel pattern.

Themes provide a set of standard pattern look-up resources for use by the appearance management layer which are described below. The pattern lookup table defines the set of colors and patterns used by the theme and is used to build the theme's pattern look-up table. The part index table maps the set of standard theme pattern indices into the pattern look-up table. An exemplary implementation of a PatternLookupTable and a PartIndexTable is:

#define kPatRGBKind ’clut’ //color lookup table id + index #define kPatPixPatKind ’ppat’ //PixPat id #define kPatColorPatKind ’cpat’ //ColorPattern id // Pattern Lookup Tables typedef struct { OSType patternKind; // kind of pattern, ie. kPatRGBKind SInt16 patternID; // pattern resource identifier UInt16 index; // index within resource UInt32 patternData [2]; // pattern data holder when loaded } PatternLookupTableEntry; typedef struct { UInt16 numEntries; // count of entries in table PatternLookupTableEntry entries []; // array of entries } PatternLookupTable; // Part Index Tables - maps a ThemePatternIndex into a Pattern Lookup Table typedef struct { ThemePatternIndex index; // corresponding ThemePatternIndex UInt16 plutIndex; // PatternLookupTable index } PartIndexEntry; typedef struct { UInt16 numEntries; // count of entries in table PartIndexEntry entries []; // array of entries } PartIndexTable;

As mentioned earlier, other exemplary embodiments of the present invention provide for pattern/color abstraction by returning information to the client rather than the appearance management layer commanding the graphic subsystem directly. According to these embodiments, the client will ask the appearance management layer for a structure, e.g., a PixPat structure, corresponding to a specified index and will receive a handle that will allow the application to make the appropriate drawing call to the graphic subsystem 56. An example for this embodiment is illustrated below in pseudocode:

typedef struct { UInt32 data [2]; // data block for pattern definition use } PatternData; OSErr PatternDefOpen ( ); Opens the pattern definition, initializing any global state data. The pattern def may return an error code to veto loading (for example if the pattern def cannot run on the current system configuration). OSErr PatternDefClose ( ); Closes the pattern definition and frees any global state data. This is called prior to termination of the pattern def's connection. OSErr PatternDefGetKind (OSType *pKind); Returns the pattern kind identifier. This is invoked by the appearance management layer to find the link to entries in the pattern table. OsErr PatternDefLoadData (PatternData *pData, SInt16 resId, UInt16 index); Loads the pattern data from a resource, based upon the resource id + index. OSErr PatternDefCloneData (PatternData *pData, PatData *pCopy); Clones the pattern data contained in the PatData record and places the result in *pCopy. OSErr PatternDefSetData (PatternData, PatData *pNewData); Sets the pattern data to a copy of that contained in *pNewData. OSErr PatternDefUnloadData (PatternData *pData); Frees the data stored in the pattern data record. OSErr GetPatternPixPat (PatData *pData, PixPatHandle *hPixPat); Returns the PixPat represented by the pattern data. OSErr ApplyShapeStyle (PatData *pData, GXShape shape); Modifies the state of the GX object so that it draws in the desired style. This may include creating ink, transform or other style objects and linking them to the shape, or modifying the shape itself.

Another example of how a client would interact with the pattern look-up tables 48 according to these exemplary embodiments is illustrated below. OSErr NewPatternTable (PatternTable *table);

Creates a new pattern table. OSErr GetNewpatternTable (SInt16 resID, PatternTable *table); Gets a new pattern table from a resource. OSErr DisposePatternTable (PatternTable *table); Dispose a pattern table. OSErr GetPattenDef (<PatternDef Reference>, SOMObject *patternDefObject); Load a pattern definition proc and return its SOM Object. OSErr AddPatternDefToTable (PatternTable table, SOMObject patternDefObject); Add the pattern definition proc to the table. OSErr PatternTableSetIndexData ( PatternTable table, UInt16 index, OSType kind, PatternData *pData); Set the data record associated with the table index. Application Pattern and Style Queries OSErr ThemeGetPartPixPat (PartCode part, PixPatHandle *partPixPat); Gets the PixPat associated with the part code. OSErr ThemeApplyPartStyleToShape (PartCode part, GXShape shape); Sets the style of the GXShape to the part style. OSErr PatternTableGetPixPat ( PatternTable table, UInt16 index, PixPatHandle *hPixPat); Gets the PixPat associated with the table + index. OSErr PatternTableApplyStyleToShape ( PatternTable table, UInt16 index, GXShape shape); Sets the style of the GXShape to that associated with the table + index. OSErr ThemeGetPartSeed (UInt32 *seed); Returns the seed for the theme pattern table. The seed is updated when changes are made to the pattern table which may invalidate cached PixPatsHandles. OSErr PatternTableGetSeed (UInt32 *seed); Returns the seed for the application pattern table. The seed is updated when changes are made to the pattern table which may invalidate cached PixPatsHandles. SPI OSErr InstallSystemPatDef (SOMObject patternDefObject); Installs a pattern definition in the system PatDef table.

Having described two exemplary embodiments wherein pattern look-up tables can be used to abstract patterns and colors from the interface, another example is provided below in which both embodiments are applied to the exemplary application of filling a window rectangle with the bevel background color and then drawing a bevel inset two pixels in the window. First, by way of the former, exemplary embodiment wherein drawing primitives are sent to the appearance management layer.

Rect bevelRect; OSErr error; GetWindowRect (&bevelRect); // Fill window rectangle with bevel background error = ThemeFillRect (kBevelBackground, &bevelRect); // make bevel inset 2 pixels from window edge InsetRect (&bevelRect, 2, 2); // Draw Bevel on background error = ThemeDrawBevel (&bevelRect, false);

Now, using the latter exemplary embodiment wherein the appearance management layer returns a data structure to the client.

Rect bevelRect; OSErr error; PixPatHandle hBackgroundPat; GetWindowRect (&bevelRect); // Get bevel background PixPat error = ThemeGetPartPixPat (kBevelBackground, &hBackgroundPat); // Fill window rectangle with bevel background if (error == noErr) FillCRect (&bevelRect, hBackgroundPat); // make bevel inset 2 pixels from window edge InsetRect (&bevelRect, 2, 2); // Draw Bevel on background error = ThemeDrawBevel (&bevelRect, false);

Of course, those skilled in the art will appreciate that all of the pseudocode examples provided herein are intended to be exemplary and illustrative in nature.

Themes and Theme Switching

Having described exemplary systems and methods for abstracting the appearance and behavior of a user interface from its functionality using switchable drawing procedures and pattern look-up tables, the following description indicates how these capabilities can be used together to manifest sets of appearance and behavior attributes on a user interface which blend together to project a common theme. As described earlier, themes are coordinated designs of the interface elements which combine to create a distinct visual and audio environment on the display. According to one exemplary embodiment of the present invention, users can choose among different themes from, for example, an appearance control panel which can be activated on the desktop interface. An exemplary appearance control panel is illustrated as FIG. 11.

In FIG. 11, a pop-up, pull-down or drop-down menu 140 allows users to specify an overall appearance/behavior by selecting the theme to be installed. Beneath the theme setting box 140 to the left is an options area 142 in which a user may select various options within each theme. For example, a user could specify a background color, a font and a highlight color. To the right of the options area 142, is a preview area 144 where exemplary interface elements of the theme currently selected in box 140 are shown so that a user can preview what the theme will look like before making a selection. Exemplary interface elements can include, for example, a desktop pattern, a menu bar and menu, an active window, and a dialog box with radio buttons, a checkbox, push buttons, and selected text. Using the appearance control panel, a user will be able to change the appearance of the desktop quickly and easily.

However, some users may desire even more control over the appearance and behavior of their desktop interface. Thus, according to another exemplary embodiment of the present invention, the appearance control panel can provide user selectibility over all of the objects which can be displayed on the user interface. For example, the appearance control panel could include a library of each type of interface object from which the user can select for inclusion in a user-defined theme. After selecting the different types of interface objects, the user can be prompted for a theme name under which pointers to the appropriate drawing procedures and other information for realizing the selected objects can be stored. According to still further exemplary embodiments of the present invention, an appearance object editor can be provided wherein a user can create his or her own interface objects using a library of parts provided by the object editor. For example, each of the glyphs illustrated in FIG. 5 can have a multitude of variations from which a user can create his or her own document window (both active and inactive). Once created, the new interface object can be stored in the library of interface objects from which user-defined themes can be created.

Theme attributes are a collection of theme properties that are both system-defined and theme-defined. Each of the theme's properties can be queried and set by appearance management layer functions. For example, the following properties can be defined by the system:

#define kThemeSystemFont ’sysf’ #define kThemeTextHighlightColor ’tcol’

To get a theme property, a get theme property function can be called for example by:

OSErr GetThemeProperty (OSType property, void *dataptr, Size dataSize)

This function will return the requested property from the current theme. If the current theme does not include the requested property, typeNotFoundErr is returned.

To set a theme property, call the SetThemeProperty function:

OSErr SetThemeProperty (OSType property, void *dataptr, Size datasize)

The SetThemeProperty command sets the specified theme property to the given data. Having described themes in general and ways in which themes can be created, selected and stored by a user, the following describes the operation of systems and methods according to the present invention once a theme change is requested by a user or an application beginning with FIG. 12.

FIG. 12 illustrates interactions between, for example, a theme 70, the appearance management layer 40, and an application 38. Therein block 48 includes the pattern tables as discussed above, and block 54 contains the animation and sound utilities which supplement the runtime routines of block 52. Further, an icon 68 is shown which diagrammatically illustrates an appearance control panel 69, e.g., the panel of FIG. 10, which an end user can operate to switch themes.

A current theme's resource chain 72 is opened and managed by the theme switching 50 and runtime routines 52. The resource chain 72 can include, for example, a theme attributes property list (e.g., behavior matrices as described above), theme preferences (e.g., a preferred background pattern, preferred system font, etc.), theme data resources (e.g., the pattern table which defines the set of patterns and colors used by the theme, pattern code procedures which allow definition of new pattern types, etc.) and override resources (e.g., icons for the theme which overrides system icons). The theme resource chain can be maintained separately from the resources of the currently running application, and can be switched in and out in response to a demand by either an application or a user (appearance control panel). The theme's resource chain 72 is setup whenever the appearance management layer 40 calls any of the theme's code.

As explained above with respect to the switchable drawing procedures according to exemplary embodiments of the present invention, when the appearance management layer is present, conventional drawing procedures (e.g., CDEF, LDEF, MDEF and WDEF) are replaced by the appearance management layer's switcher resources shown in FIG. 11 at blocks 74-80. Externally, these switcher resources serve the identical function as traditional drawing procedures. Internally, they permit dynamic switching to the appropriate drawing procedures by the utilities when the theme changes. This switching can be accomplished by supplying new pointers 82-88 to the drawing procedures referenced by switcher resources 74-78. In this way, when the switcher resources call back into the utilities as described above, the utilities will be pointed at the drawing procedures for the current theme.

The current theme is set by calling the appearance management layer's set theme function, for example, by the command:

OSErr SetTheme (const FSSpec *themefile)

The set theme function uses an FSSpec parameter that identifies the theme file that should be loaded and activated by the appearance management layer. In normal operation, this function loads the requested theme file, switches to the new theme and then releases the old theme. The old theme is released after the new theme is completely loaded so that if the new theme could not be activated, the system can revert back to the original theme such that the user does not become stranded without an interface.

The exemplary steps illustrated in the flowchart of FIG. 13 can be executed to open the new theme file. At block 100, a new theme info record is created. This data structure contains all of the global information that the appearance management layer uses to keep track of the state of the current theme and contains its own resource chain information, e.g., procedure pointer tables for the switcher, the theme property list, the theme pattern tables, etc.

Next, the appearance management layer creates a new resource chain at block 102. The new theme's resource file is then opened at 104 after which the theme's runtime code is loaded, at 106, and its open function is called. At this time, the new theme can test the operating conditions of the system to determine if the load should continue or be aborted. If the load aborts, the theme may present an alert to the user as to why the theme could not be loaded. If the theme has its own preferences file, it can be opened by the theme at this time.

The theme's property list is loaded at block 108, for example, by calling a get resource function. This allows the property list to come from any preferences file that may have been opened in the previous step. If a property list is found, it is stored in the theme info record. Subsequently, at block 110, the theme's pattern look-up table is loaded. First, all pattern definition procedure resources are loaded. Then the standard pattern look-up table and part index table resources are loaded. The pattern look-up table is then built from the contents of these resources. A pointer table to be used by the switcher resources is then built as shown by block 112. This table is stored in the theme info record. Lastly, the new theme's initialize function is called at block 114. The new theme can allocate memory or load extra resources that it requires while being active.

FIG. 14 illustrates steps that can be executed to switch from an old theme to a new theme. First, a transition effect can be presented as block 116. For example, the screen may fade to black, a dialog can be presented, or the themes could gradually blend from one to the other, e.g., “morphing”. Then, the old theme's resource chain is switched in as described by block 118. All of the drawing procedures are called with a deallocate message. These messages 120 are sent to the appearance management layer's switcher definition procedures, which are currently routing messages to the old theme's implementations of the definition procedures. This allows any of the theme's definition functions to deallocate any global data that they may have been allocated.

The appearance management layer sets the new theme info record as the current theme's information record at 122. Once the new theme info record is set, all of the external calls into the appearance management layer will affect the new theme. The new theme's resource chain is switched in at block 124. All of the drawing procedures are called with an initialize message. These messages are sent to the appearance management layer's switcher resources, which are currently routing messages to the new theme's implementations of the drawing procedures. This allows any of the theme's definition functions to allocate any global data that they may need.

The steps executed to release the old theme file are shown in FIG. 15. First, at block 128, the old theme's resource chain is switched in. Next, the old theme's deallocate function is called at 130. The theme is responsible for disposing of any allocations that it may have made when it received its initialize message. The old pointer table used by the switcher definition procedures is disposed of per block 132. Then, the old theme's pattern look-up table and property list are disposed of as denoted by blocks 134 and 136, respectively. The files in the old theme's resource chain can then be closed and the resource chain disposed of prior to disposing of the old theme's theme info record (blocks 138 and 140).

If an error occurs while trying to open and load the new theme or while switching from the old theme to the new theme, the switch is aborted and the set theme function attempts to reverse all of the steps that have already successfully completed so that the system continues to generate an interface using the old theme. The error that caused the switch to abort can be returned by this function. To request that the default system theme is switched in, either an FSSpec parameter to the system file or NIL can be passed in the themefile parameter.

To determine what theme file is currently active, a get theme function can be called, for example by the command:

OSErr GetTheme (FSSpec *currentThemeSpec)

An FSSpec parameter value referencing the currently active theme file will be returned in the currentThemeSpec parameter. If the current theme is the default system theme, an FSSpec referencing the system file will be returned. If an error occurs while attempting to locate the FSSpec of the current theme, an appropriate error code will be returned and the currentThemeSpec parameter will remain unchanged.

Normally, the current theme's resource file is not present in the currently running application's resource chain. This can be done to prevent resource identification conflicts between applications, the operating system and the current theme. The appearance management layer maintains a separate resource chain that contains the current theme file and any other files that the current theme may have opened (such as a preferences file). When the appearance management layer executes code in the theme, the theme's resource chain is setup by the appearance management layer, which allows for normal GetResource calls to be used to get theme resources. If an application wishes to gain access to the current theme's resources, several functions can be provided. For example, to get a resource from the current theme file, a get theme resource function can be called, for example:

Handle GetThemeResource (OSType restype, UInt16 id)

GetThemeResource has the same function as the GetResource function, except that this command gets the resource from the current theme's resource chain.

If more flexibility is needed when getting resources from the current theme file, the low-level appearance management layer function GetThemeTopMapHandle may be used to get the top of the current theme's resource chain.

OSErr GetThemeTopMapHandle (Handle *themeMap)

The GetThemeTopMapHandle function returns the top map handle that contains the current theme file and any other opened theme files (such as a preferences file) and all of the system resource maps. Caution should be exercised when using the GetThemeTopMapHandle function to avoid leaving the theme's resource chain switched in when executing utility functions or after returning to other parts of an application's code. When the theme's resource chain is switched in, the application's resource chain is unavailable. Note also that when the theme changes, this map handle and associated resources will no longer be valid, so this value should not be cached.

A theme can implement three theme definition functions that the appearance management layer calls when a theme is being loaded or disposed of. When the appearance management layer begins to switch to a theme, immediately following that theme's resource file being opened, the theme's function can be called.

pascal OSErr ThemeFilePreflight (void *themedata)

The theme's test function is called before any resources are loaded by the appearance management layer. In this way, the theme has an opportunity to test the conditions of the operating system (such as memory or graphics capability). If the test function returns an error, the appearance management layer will close the theme file and not attempt to continue loading. If the test function returns no error, the appearance management layer continues to load the theme, as described above.

The themedata parameter returned by the exemplary test function shown above is used by the theme to allocate and store any global data that the theme wishes to keep for itself. On entry to the test function, the themedata parameter points to NIL. The test function (or any of the other theme definition functions) may change the value pointed to by themedata. This themedata value is persistent as long as the theme remains loaded.

When the appearance management layer is finished loading all of the theme's resources and loading each of the theme's standard definition procedures, the theme's initialize function is called, for example:

pascal OSErr ThemeFileInitialize (void *themedata)

The theme's initialize function can be used to do any special processing after the appearance management layer has completely loaded the theme. It may allocate data structures, load additional resources, open preferences files, setup its theme property list, etc. The themedata parameter points to a global storage location useful for storing a pointer to the themes global data. If the theme's initialize function returns an error, the appearance management layer will abort the switch to the theme. The appearance management layer will dispose of any allocations it has already made and close the theme file.

When the appearance management layer is preparing to unload a theme, the theme's dispose function is called, for example:

pascal OSErr ThemeFileDispose (void *themedata)

The dispose function should dispose of any allocations that were made with either the test or initialize functions. The theme file then has an opportunity to store any resources in its preferences file and/or set its theme properties. After the theme returns from this function, the appearance management layer will deallocate all of the appearance management layer's storage for the theme and close the theme's file.

Those skilled in the art will appreciate that the foregoing described exemplary embodiments can be implemented using, for example, various types of computer systems. A typical computer system can have a monitor or display connected to a processor for display of the graphical user interfaces described herein. The computer system can also have known I/O devices (e.g., CD drives, floppy disk drives, hard drives, etc.) which can store and read programs and data structures used to implement the above-described techniques. These programs and data structures can be encoded such computer-readable media. For example, the layout resources described above can be stored on computer-readable media independently of the computer-readable medium on which the layout engine itself resides.

The above-described exemplary embodiments are intended to be illustrative in all respects, rather than restrictive, of the present invention. Thus the present invention is capable of many variations in detailed implementation that can be derived from the description contained herein by a person skilled in the art. All such variations and modifications are considered to be within the scope and spirit of the present invention as defined by the following claims. 

What is claimed is:
 1. A computer readable medium encoded with a layout resource that can be used to draw an object on a user interface, said layout resource comprising a plurality of data structures comprising: a list of parameters including: a first sublist of parameters associated with boundaries of said object; and a second sublist of parameters associated with parts of said object.
 2. The computer readable medium of claim 1, wherein said first sublist of parameters includes a data structure having a value that indicates a number of boundaries defined within said layout resource.
 3. The computer readable medium of claim 1, wherein said first sublist of parameters includes at least one boundary data structure which defines a boundary associated with said object, said boundary data structure including a start boundary parameter which identifies a first previously placed boundary relative to which said boundary is to be placed on said user interface.
 4. The computer readable medium of claim 3, said boundary data structure includes a limit boundary parameter which identifies a second previously placed boundary relative to which said boundary is to be placed on said user interface.
 5. The computer readable medium of claim 4, wherein said at least one boundary data structure further includes a limittype parameter which constrains placement of said boundary relative to said start boundary.
 6. The computer readable medium of claim 5, wherein if said limittype parameter is set to a predetermined parameter and said boundary is to be placed beyond a threshold, then said boundary is instead placed at said limit boundary.
 7. The computer readable medium of claim 5, wherein if said limittype parameter is set to a predetermined parameter and said boundary is to be placed beyond a threshold, then said boundary is instead placed at said start boundary.
 8. The computer readable medium of claim 3, wherein said boundary data structure further includes an offset parameter having a value which is used to determine a relative positioning of said boundary to said previously placed boundary.
 9. The computer readable medium of claim 8, wherein said boundary data structure further includes an offsettype parameter having a value which indicates a manner in which said offset parameter is used to determine a relative positioning of said boundary to said previously placed boundary.
 10. The computer readable medium of claim 9, wherein if said offsettype parameter equals a predetermined parameter then said offset parameter is added to said previously placed boundary to obtain said boundary's location.
 11. The computer readable medium of claim 9, wherein if said offsettype parameter equals a predetermined parameter then said offset parameter is used as an index into an array and a value stored at said array index is added to said previously placed boundary to obtain said boundary's location.
 12. The computer readable medium of claim 9, wherein if said offsettype parameter equals a predetermined parameter then said offset parameter is ignored and said boundary is placed halfway between said previously placed boundary and a limit boundary.
 13. The computer readable medium of claim 1, wherein said first sublist includes a first set of data structures associated with boundary placement relative to one or more existing boundaries and a second set of data structures associated with boundary limits.
 14. The computer readable medium of claim 1, wherein said second sublist of parameters includes a data structure having a value that indicates a number of parts defined within said layout resource.
 15. The computer readable medium of claim 1, wherein said second sublist of parameters includes at least one part data structure which defines a part associated with said object, said part data structure including an inclusion attribute mask which specifies drawing of said part based upon a presence of at least one attribute.
 16. The computer readable medium of claim 15, wherein said part data structure further includes an exclusion attribute mask which specifies drawing of said part based upon an absence of at least one attribute.
 17. The computer readable medium of claim 16, wherein said inclusion attribute mask and said exclusion attribute mask both have bits associated with a same attribute.
 18. The computer readable medium of claim 17, wherein, if neither of said associated bits in said inclusion attribute mask and said exclusion attribute mask are set, then said part will be drawn regardless of whether said object includes said same attribute.
 19. The computer readable medium of claim 17, wherein if said associated bit of said inclusion attribute mask is set and said associated bit of said exclusion attribute mask is not set, then said part will be drawn only if said object has said same attribute.
 20. The computer readable medium of claim 17, wherein if said associated bit of said inclusion attribute mask is not set and said associated bit of said exclusion attribute mask is set, then said part will be drawn only if said object does not have said same attribute.
 21. The computer readable medium of claim 17, wherein if said associated bit of said inclusion attribute mask is not set and said associated bit of said exclusion attribute mask is not set, then said part will be drawn regardless of whether said object has said same attribute.
 22. The computer readable medium of claim 1, wherein said second sublist of parameters includes at least one part data structure which defines a part associated with said object, said part data structure including a regionset parameter which identifies at least one set to which said part belongs.
 23. The computer readable medium of claim 1, wherein said second sublist of parameters includes at least one part data structure which defines a part associated with said object, said part data structure including a plurality of parameters which identify boundaries within which said part is to be drawn.
 24. The computer readable medium of claim 1, wherein said second sublist of parameters includes at least one part data structure which defines a part associated with said object, said part data structure including at least one parameter which identifies a manner in which said part is to be filled.
 25. The computer readable medium of claim 24, wherein said at least one parameter identifies a color pattern to be used to fill said part.
 26. The computer readable medium of claim 25, said part data structure further includes a parameter which identifies an orientation for said color pattern relative to said part.
 27. A computer system comprising: a processor for performing control functions and processing data; a display for outputting data received from said processor and for receiving input from a user of said computer system via a graphical user interface; and a data driven layout engine for drawing an object on said graphical user interface, wherein said layout engine receives a command from said processor to draw said object that includes a pointer to a layout resource, said layout resource including a list of boundary and part information that is traversed only once by said layout engine to draw said object, wherein said layout resource comprises a data structure including: a list of parameters including: a first sublist of parameters associated with boundaries of said object; and a second sublist of parameters associated with parts of said object.
 28. The computer system of claim 27, wherein said object is a window.
 29. The computer system of claim 27, wherein said object is a menu.
 30. The computer readable medium of claim 27, wherein said first sublist of parameters includes a data structure having a value that indicates a number of boundaries defined within said layout resource.
 31. The computer system of claim 27, wherein said first sublist of parameters includes at least one boundary data structure which defines a boundary associated with said object, said boundary data structure including a start boundary parameter which identifies a first previously placed boundary relative to which said boundary is to be placed on said user interface.
 32. The computer system claim 31, wherein said boundary data structure further includes an offset parameter having a value which is used to determine a relative positioning of said boundary to said previously placed boundary.
 33. The computer system of claim 32, wherein said boundary data structure further includes an offsettype parameter having a value which indicates a manner in which said offset parameter is used to determine a relative positioning of said boundary to said previously placed boundary.
 34. The computer system of claim 33, wherein if said offsettype parameter equals a predetermined parameter then said offset parameter is added to said previously placed boundary to obtain said boundary's location.
 35. The computer system of claim 33, wherein if said offsettype parameter equals a predetermined parameter then said offset parameter is used as an index into an array and a value stored at said array index is added to said previously placed boundary to obtain said boundary's location.
 36. The computer system of claim 33, wherein if said offsettype parameter equals a predetermined parameter then said offset parameter is ignored and said boundary is placed halfway between said previously placed boundary and a limit boundary.
 37. The computer system of claim 31, said boundary data structure includes a limit boundary parameter which identifies a second previously placed boundary relative to which said boundary is to be placed on said user interface.
 38. The computer system of claim 37, wherein said at least one boundary data structure further includes a limittype parameter which constrains placement of said boundary relative to said start boundary.
 39. The computer system of claim 38, wherein if said limittype parameter is set to a predetermined parameter and said boundary is to be placed beyond a threshold, then said boundary is instead placed at said limit boundary.
 40. The computer system of claim 37, wherein if said limittype parameter is set to a predetermined parameter and said boundary is to be placed beyond a threshold, then said boundary is instead placed at said start boundary.
 41. The computer system of claim 27, wherein said first sublist includes a first set of data structures associated with boundary placement relative to one or more existing boundaries and a second set of data structures associated with boundary limits.
 42. The computer system of claim 27 wherein said second sublist of parameters includes a data structure having a value that indicates a number of parts defined within said layout resource.
 43. The computer system of claim 27, wherein said second sublist of parameters includes at least one part data structure which defines a part associated with said object, said part data structure including an inclusion attribute mask which specifies drawing of said part based upon a presence of at least one attribute.
 44. The computer system of claim 43, wherein said part data structure further includes an exclusion attribute mask which specifies drawing of said part based upon an absence of at least one attribute.
 45. The computer system of claim 44, wherein said inclusion attribute mask and said exclusion attribute mask both have bits associated with a same attribute.
 46. The computer system of claim 45, wherein, if neither of said associated bits in said inclusion attribute mask and said exclusion attribute mask are set, then said part will be drawn regardless of whether said object includes said same attribute.
 47. The computer system of claim 45, wherein if said associated bit of said inclusion attribute mask is set and said associated bit of said exclusion attribute mask is not set, then said part will be drawn only if said object has said same attribute.
 48. The computer system of claim 45, wherein if said associated bit of said inclusion attribute mask is not set and said associated bit of said exclusion attribute mask is set, then said part will be drawn only if said object does not have said same attribute.
 49. The computer system of claim 45, wherein if said associated bit of said inclusion attribute mask is not set and said associated bit of said exclusion attribute mask is not set, then said part will be drawn regardless of whether said object has said same attribute.
 50. The computer system of claim 27, wherein said second sublist of parameters includes at least one part data structure which defines a part associated with said object, said part data structure including a regionset parameter which identifies at least one set to which said part belongs.
 51. The computer system of claim 27, wherein said second sublist of parameters includes at least one part data structure which defines a part associated with said object, said part data structure including a plurality of parameters which identify boundaries within which said part is to be drawn.
 52. The computer system of claim 27, wherein said second sublist of parameters includes at least one part data structure which defines a part associated with said object, said part data structure including at least one parameter which identifies a manner in which said part is to be filled.
 53. The computer system of claim 52, wherein said at least one parameter identifies a color pattern to be used to fill said part.
 54. The computer system of claim 53, said part data structure further includes a parameter which identifies an orientation for said color pattern relative to said part. 